CHAP and rewrite components
Identifieur interne : 002746 ( Main/Exploration ); précédent : 002745; suivant : 002747CHAP and rewrite components
Auteurs : Sándor Vágvölgyi [Hongrie]Source :
- Acta Informatica [ 0001-5903 ] ; 2011-08-01.
Abstract
Abstract: We present an additional feature to the Challenge Handshake Authentication Protocol. It makes the protocol resilient to offline brute-force/dictionary attacks. We base our contribution to the protocol on the concept of a rewrite complement for ground term rewrite systems (GTRSs). We also introduce and study the notion of a type-based complement which is a special case of a rewrite complement. We show the following decision results. Given GTRSs A, C, and a reduced GTRS B over some ranked alphabet Σ, one can decide whether C is a type-based complement of A for B. Given a GTRS A and a reduced GTRS B over some ranked alphabet Σ, one can decide whether there is a GTRS C such that C is a type-based complement of A for B. If the answer is yes, then we can construct such a GTRS C.
Url:
DOI: 10.1007/s00236-011-0141-z
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001079
- to stream Istex, to step Curation: 001063
- to stream Istex, to step Checkpoint: 000646
- to stream Main, to step Merge: 002788
- to stream Main, to step Curation: 002746
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">CHAP and rewrite components</title><author><name sortKey="Vagvolgyi, Sandor" sort="Vagvolgyi, Sandor" uniqKey="Vagvolgyi S" first="Sándor" last="Vágvölgyi">Sándor Vágvölgyi</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:474FAA2409397C21A42FEA4C18B30C8088EB1161</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1007/s00236-011-0141-z</idno><idno type="url">https://api.istex.fr/ark:/67375/VQC-7D3G9TGK-F/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001079</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001079</idno><idno type="wicri:Area/Istex/Curation">001063</idno><idno type="wicri:Area/Istex/Checkpoint">000646</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000646</idno><idno type="wicri:doubleKey">0001-5903:2011:Vagvolgyi S:chap:and:rewrite</idno><idno type="wicri:Area/Main/Merge">002788</idno><idno type="wicri:Area/Main/Curation">002746</idno><idno type="wicri:Area/Main/Exploration">002746</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">CHAP and rewrite components</title><author><name sortKey="Vagvolgyi, Sandor" sort="Vagvolgyi, Sandor" uniqKey="Vagvolgyi S" first="Sándor" last="Vágvölgyi">Sándor Vágvölgyi</name><affiliation wicri:level="1"><country xml:lang="fr">Hongrie</country><wicri:regionArea>Department of Foundations of Computer Science, University of Szeged, Árpád tér 2, 6720, Szeged</wicri:regionArea><wicri:noRegion>Szeged</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Hongrie</country></affiliation></author></analytic><monogr></monogr><series><title level="j">Acta Informatica</title><title level="j" type="abbrev">Acta Informatica</title><idno type="ISSN">0001-5903</idno><idno type="eISSN">1432-0525</idno><imprint><publisher>Springer-Verlag</publisher><pubPlace>Berlin/Heidelberg</pubPlace><date type="published" when="2011-08-01">2011-08-01</date><biblScope unit="volume">48</biblScope><biblScope unit="issue">5-6</biblScope><biblScope unit="page" from="317">317</biblScope><biblScope unit="page" to="361">361</biblScope></imprint><idno type="ISSN">0001-5903</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0001-5903</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We present an additional feature to the Challenge Handshake Authentication Protocol. It makes the protocol resilient to offline brute-force/dictionary attacks. We base our contribution to the protocol on the concept of a rewrite complement for ground term rewrite systems (GTRSs). We also introduce and study the notion of a type-based complement which is a special case of a rewrite complement. We show the following decision results. Given GTRSs A, C, and a reduced GTRS B over some ranked alphabet Σ, one can decide whether C is a type-based complement of A for B. Given a GTRS A and a reduced GTRS B over some ranked alphabet Σ, one can decide whether there is a GTRS C such that C is a type-based complement of A for B. If the answer is yes, then we can construct such a GTRS C.</div></front></TEI><affiliations><list><country><li>Hongrie</li></country></list><tree><country name="Hongrie"><noRegion><name sortKey="Vagvolgyi, Sandor" sort="Vagvolgyi, Sandor" uniqKey="Vagvolgyi S" first="Sándor" last="Vágvölgyi">Sándor Vágvölgyi</name></noRegion><name sortKey="Vagvolgyi, Sandor" sort="Vagvolgyi, Sandor" uniqKey="Vagvolgyi S" first="Sándor" last="Vágvölgyi">Sándor Vágvölgyi</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002746 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002746 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:474FAA2409397C21A42FEA4C18B30C8088EB1161
|texte= CHAP and rewrite components
}}
| This area was generated with Dilib version V0.6.33. |  |